Minimum coverings of Kn with hexagons
نویسنده
چکیده
The edge set of Kn cannot be decomposed into edge-disjoint hexagons (or 6-cycles) when n =1= 1 or 9 (mod 12). We discuss adding edges to the edge set of Kn so that the resulting graph can be decomposed into edge-disjoint hexagons. This paper gives the solution to this minimum covering of Kn with hexagons problem.
منابع مشابه
Packing and covering the complete graph with cubes
A decomposition of Kn \L, the complete graph of order n with a subgraph L (called the leave) removed, into edge disjoint copies of a graph G is called a maximum packing of Kn with G if L contains as few edges as possible. A decomposition of Kn U P, the complete graph union a graph P (called the padding), into edge disjoint copies of a graph G is called a minimum covering of Kn with G if P conta...
متن کاملMaximum packings of Kn with hexagons
A complete solution of the maximum packing problem of Kn with hexagons is given.
متن کاملRevisiting the intersection problem for minimum coverings of complete graphs with triples
The intersection problem for minimum covers of Kn with triples has previously been settled in the case where the paddings are required to be equal. In this paper we extend this result by considering two generalizations: the paddings need not be equal, and the paddings are required to be simple.
متن کاملAlmost resolvable minimum coverings of complete graphs with 4-cycles
If the complete graph Kn has vertex set X, a minimum covering of Kn with 4-cycles, (X,C, P ), is a partition of the edges of Kn ∪ P into a collection C of 4-cycles, where P is a subgraph of λKn and the number of edges in P is as small as possible. An almost parallel class of a minimum covering of Kn with 4-cycles is a largest possible collection of vertex disjoint 4-cycles (so with n/4 4-cycles...
متن کاملMultiple vertex coverings by specified induced subgraphs
Given graphs H1, . . . ,Hk, let f(H1, . . . ,Hk) be the minimum order of a graph G such that for each i, the induced copies of Hi in G cover V (G). We prove constructively that f(H1,H2) ≤ 2(n(H1) + n(H2) − 2); equality holds when H1 = H2 = Kn. We prove that f(H1,Kn) = n + 2 √ δ(H1)n + O(1) as n → ∞. We also determine f(K1,m−1,Kn) exactly.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 16 شماره
صفحات -
تاریخ انتشار 1997